Dialogues for proof search
نویسنده
چکیده
Dialogue games are a two-player semantics for a variety of logics, including intuitionistic and classical logic. Dialogues can be viewed as a kind of analytic calculus not unlike tableaux. Can dialogue games be an effective foundation for proof search in intuitionistic logic (both first-order and propositional)? We announce Kuno, an automated theorem prover for intuitionistic first-order logic based on dialogue games.
منابع مشابه
Argumentation Schemes and Burden of Proof
This paper analyzes the phenomenon of a shift of the burden of proof in persuasion dialogues in which arguments are constructed according to argumentation schemes. Some sample dialogues are analyzed with arguments from expert opinion, revealing that some critical questions of this scheme carry with them a burden of proof on the questioner while others do not, and that the burden of proof can be...
متن کاملMulti-Agent Dialogue Games and Dialogue Sequents for Proof Search and Scheduling
Dialogical games as introduced by Lorenzen and Lorenz describe a reasoning technique mainly used for intuitionistic and classical predicate logic: two players (proponent and opponent) argue about the validity of a given formula according to predefined rules. If the proponent has a winning-strategy then the formula is proven to be valid. The underlying game rules can be modified to have an impac...
متن کاملA Task Independent Oral Dialogue Model
This paper presents a human-machine dialogue model in the field of task-oriented dialogues. The originality of this model resides in the clear separation of dialogue knowledge from task knowledge in order to facilitate for the modeling of dialogue strategies and the maintenance of dialogue coherence. These two aspects are crucial in the field of oral dialogues with a machine considering the cur...
متن کاملDialogue Systems as Proof Editors
This paper shows how a dialogue system for information-seeking dialogues can be implemented in a type-theory-based syntax editor, originally developed for editing mathematical proofs. The implementation gives a simple logical metatheory to such dialogue systems and also suggests new functions to them, e.g. a local undo operation. The method developed provides a logically based declarative way o...
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014